The separability of cartesian products
نویسندگان
چکیده
منابع مشابه
Condensations of Cartesian products
We consider when one-to-one continuous mappings can improve normalitytype and compactness-type properties of topological spaces. In particular, for any Tychonoff non-pseudocompact space X there is a μ such that X can be condensed onto a normal (σ-compact) space if and only if there is no measurable cardinal. For any Tychonoff space X and any cardinal ν there is a Tychonoff space M which preserv...
متن کاملHomogeneous cartesian products
A graph G is 1-homogeneous if certain isomorphisms between similarly embedded induced subgraphs of G extend to automorphisms of G. We show that the only connected composite 1-homogeneous graphs are the cube, and Kn ×K2 and Kn ×Kn with n ≥ 2.
متن کاملCorners in Cartesian products
This note is an illustration of the density-increment method used in the proof of the density Hales-Jewett theorem for k = 3. (Polymath project [2]) I will repeat the argument applying it to a problem which is easier than DHJ. In the last section I will describe the proof of the density Hales-Jewett theorem for k = 3. The results stated here are direct interpretations of the project’s results, ...
متن کاملDomination of generalized Cartesian products
The generalized prism πG of G is the graph consisting of two copies of G, with edges between the copies determined by a permutation π acting on the vertices of G. We define a generalized Cartesian product G π H that corresponds to the Cartesian product G H when π is the identity, and the generalized prism when H is the graph K2. Burger, Mynhardt and Weakley [On the domination number of prisms o...
متن کاملDominating Cartesian Products of Cycles
Let y(G) be the domination number of a graph G and let G U H denote the Cartesian product of graphs G and H. We prove that y(X) = (nr= ,nr)/(2m + l), where X = C1 0 CZ 0 ... 0 C, and all nt = ICkIr 1 < k < m, are multiples of 2m + 1. The methods we use to prove this result immediately lead to an algorithm for finding minimum dominating sets of the considered graphs. Furthermore the domination n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1967
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-17-2-285-288